Contracts for concurrency

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adding Concurrency to Smart Contracts

Modern cryptocurrency systems, such as Ethereum, permit complex financial transactions through scripts called smart contracts. These smart contracts are executed many, many times, always without real concurrency. First, all smart contracts are serially executed by miners before appending them to the blockchain. Later, those contracts are serially re-executed by validators to verify that the sma...

متن کامل

On States for concurrency

The notions of state and history can be used not only to analyze and reason about a sequential program but also about concurrent programs that involve two or more processes. As an example to accompany this introduction we take the back-and-forth algorithm which is a very simple mutual exclusion algorithm for two processes. It is a simplified version of the Peterson–Fischer algorithm which will ...

متن کامل

Time for Concurrency

A hierarchy of models that capture realistic aspects of reactive and real-time systems is introduced. On the most abstract level, the qualitative (non-quantitative) model captures the temporal precedence aspect of time. A more re-ned model is that of timed transition systems, representing the metric aspects of time. The third and most detailed model is that of hybrid systems. This model allows ...

متن کامل

I-24: Consents and Contracts for Embryo Cryopreservation

Background: Couples receiving IVF treatment may choose to have embryos frozen, with the aim of creating a pregnancy and ultimately a live birth in future. Problems can arise when couples separate. Under UK law, embryos can only be transferred with the consent of both genetic parents. The issue came to public prominence in the case of Natallie Evans, who lost the opportunity to have her own gene...

متن کامل

Simplicial models for concurrency

We model both concurrent programs and the possible executions from one state to another in a concurrent program using simplices. The latter are calculated using necklaces of simplices in the former.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Formal Aspects of Computing

سال: 2008

ISSN: 0934-5043,1433-299X

DOI: 10.1007/s00165-007-0063-2